Skew Partial Fields, Multilinear Representations of Matroids, and a Matrix Tree Theorem
نویسندگان
چکیده
ABSTRACT. We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte’s definition, using chain groups. We show how such representations behave under duality and minors, we extend Tutte’s representability criterion to this new class, and we study the generator matrices of the chain groups. An example shows that the class of matroids representable over a skew partial field properly contains the class of matroids representable over a skew field. Next, we show that every multilinear representation of a matroid can be seen as a representation over a skew partial field. Finally we study a class of matroids called quaternionic unimodular. We prove a generalization of the Matrix Tree theorem for this class. MSC subject classification: 05B35
منابع مشابه
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P′ ⊆ P. We say that B confines M to P′ if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled P′-matrix. We show that, under some conditions on the partial fields, on M , and on B, verifying whether B confines M to P′ amounts to a finite check. A corollary of t...
متن کاملLifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields F1, . . . ,Fk, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First, parts of Whittle’s characterization of representations of ternary matroids follow from our theorem. Second, we prove the following theorem by Vertigan: if a m...
متن کاملThe (R,S)-symmetric and (R,S)-skew symmetric solutions of the pair of matrix equations A1XB1 = C1 and A2XB2 = C2
Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...
متن کاملRank-width and Well-quasi-ordering of Skew-Symmetric or Symmetric Matrices (extended abstract)
We prove that every infinite sequence of skew-symmetric or symmetric matrices M1, M2, . . . over a fixed finite field must have a pair Mi, Mj (i < j) such that Mi is isomorphic to a principal submatrix of the Schur complement of a nonsingular principal submatrix in Mj , if those matrices have bounded rank-width. This generalizes three theorems on well-quasi-ordering of graphs or matroids admitt...
متن کاملAn Introduction to Transversal Matroids
1. Prefatory Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Several Perspectives on Transversal Matroids . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1. Set systems, transversals, partial transversals, and Hall’s theorem . . . . . . . . 2 2.2. Transversal matroids via matrix encodings of set systems . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012